Bisimulation equivalence of differential-algebraic systems

Equivalence Semantics for Process Algebraic Language: Standard and Symbolic Bisimulation

Strong Splitting Bisimulation Equivalence

We present ACP, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to present ACP in a concise and intuitively clear way, and to bring the notion of splitting bisimulation e...

Axiomatising ST-Bisimulation Equivalence

A simple ST operational semantics for a process algebra is provided, by defining a set of operational rules in Plotkin’s style. This algebra comprises TCSP parallel composition, ACP sequential composition and a refinement operator, which is used for replacing an action with an entire process, thus permitting hierarchical specification of systems. We prove that ST-bisimulation equivalence is a c...

Bisimulation and Language Equivalence

One way to understand an interactive system is firmly rooted in language theory, that a system is its set of runs (or words). Properties of systems are described in a linear time temporal logic. Relationships between automata, language theory and logic are then utilised, such as the theory of ω-regular languages and Büchi automata. An alternative viewpoint is that an interactive system should b...

Epistemic Equivalence and Bisimulation

Bisimulation is an equivalence relation over Kripke models. It is often claimed, but little argued for, that bisimulation captures a ‘natural’ notion of similarity in epistemic semantics, in the sense that the differences between bisimilar models are, from an epistemic point of view, irrelevant. In this paper we examine three types of arguments pertaining to the view that bisimilar models are ‘...